Adaptive generation of perceptually uniform samples for printer characterization

ABSTRACT

A method is provided for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space. The method comprises: generating lines, each including a plurality of samples, in a printer 3-D signal space; printing signal space color targets; measuring the signal space color targets; generating lines with a plurality of perceptually uniform samples; generating polygon shapes in the 3-D signal space from the perceptually uniform sampled lines; calculating addition perceptually uniform sample points associated with each polygon; and, generating a final target in the printer 3-D signal space using the calculated perceptually uniform sample points. In one aspect, generating lines, includes: for each line, generating a metric distance function; creating a plurality of perceptually uniform samples on the function output axis; and, using the inverse of the metric distance function, mapping perceptually uniform samples onto the line.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] This invention generally relates to color printer and digital imaging technology and, more particularly, to a method for calibrating a printer three-dimensional signal space into perceptually uniform gradations.

[0003] 2. Description of the Related Art

[0004] Every color printer or color imaging system operates by defining a color space. Although different systems exist for defining color, one common system is the three dimensional signal space forming a cube with a black (O) vertex, a white (W) vertex, the three primary color vertices; red (R), green (G), and blue (B), and three secondary vertices; cyan (C), magenta (M), and yellow (Y). This color space is known as RGB or CMY. Other definitions of color space, such as CMYK, can be translated into the above-described system.

[0005] However, the color space definitions between different printers need not necessarily be the same. Alternately stated, a pixel with a specific color space definition does not necessarily appear the same when printed from different printers. For example, an imaging software application loaded on a personal computer (PC) may intend to create a pixel defined as 10% red, 10% green, and 80% blue (10, 10, 80). This pixel information is sent to two different color printers associated with the PC. When printed on the first printer, the pixel may appear as (10, 10, 80), as intended. However, due to variances between manufactures, for example, on the first printer when objectively measured. Alternately stated, the color instructions sent by the PC are device dependent. In this circumstance, a perfect match between intended and actual pixel colors can only occur if RGB color space profile of both printers can be derived, and a conversion invented to translate between the PC color space and the printer color space.

[0006] In generating color conversion tables for printers, there is a need to extensively sample the device color space (such as RGB, CMY, or CMYK) to create a printer target. It is highly desirable to sample the device color space in such a way that the output colors are more or less evenly distributed in a perceptual uniform color space, such as the CIELAB space. However, different types of printers have different characteristics and it is not possible to have one target that works equally well for all types of printers.

[0007] It would be advantageous if a printer's color, or signal space could be calibrated to create a perceptually uniform color space.

[0008] It would be advantageous if a printer's color space profile could be easily generated, to permit the printer to render perceptually consistent colors.

SUMMARY OF THE INVENTION

[0009] The present invention solves the above-mentioned problems by using a fixed preliminary target that contains a small fraction of the total number of color samples on the final target. By measuring the CIELAB values of samples on the preliminary target, and calculating additional sample points, a final target can be constructed with a large number of color patches that sample the CIELAB space approximately uniformly.

[0010] It should be understood that there is a difference between signal space and perceptual uniform space. Signal space is RGB or CMY, which represents the signals that drive a printer, for example. Perceptual uniform space, such as the CIELAB space, has nothing to do with any particular device, but is related to the human visual system. The signal space of a device is usually not perceptually uniform, and this fact makes the present invention useful. That is, a uniform sampling of the signal space will, most likely, not reveal a uniform distribution in perceptual space. To find out how samples specified in the signal space are distributed in a perceptually uniform space, printed samples must be measured. The objective is to sample the 3-D signal space, for example a cube, most likely a non-uniformly in the signal space, so that a new set of samples can be derived in the signal space that are uniformly distributed in the perceptual space.

[0011] One well-known perceptual color fidelity metric is International Commission on Illumination (CIE) L*a*b* standard color space specification. L is brightness, a is the red-green channel, and b is the yellow-blue channel. To measure a perceptual difference between two sources, the spectral power distribution of the sources is converted to XYZ representations, which represents the spectral power sensitivities of the three cones on the human retina. Then, the XYZ values are transformed into an L, a, b space. Uniform distances in this space correspond to uniform perceptual differences. That is, the space is a perceptually uniform space. The perceptual difference between the two sources or targets can be calculated by taking the Euclidean distance of the two in this L, a, b space.

[0012] Accordingly, a method is provided for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space. The method comprises: generating lines, each including a plurality of samples, in a printer 3-D signal space; in response to the line samples, printing signal space color targets; measuring the signal space color targets; from the signal space color targets, generating lines with a plurality of perceptually uniform samples; generating polygon shapes in the 3-D signal space from the perceptually uniform sampled lines; calculating addition perceptually uniform sample points associated with each polygon; and, generating a final target in the printer 3-D signal space using the calculated perceptually uniform sample points.

[0013] In one aspect of the invention, generating lines in a printer 3-D signal space includes generating 19 lines. That is, lines are generated between the black (O), white (W), blue (B), cyan (C), green (G), magenta (M), red (R), and yellow (Y) vertices in RGB and CMY color space.

[0014] In other aspects, generating lines, each including a plurality of perceptually uniform samples includes: for each line, generating a metric distance function having an input axis to accept signal space samples and an output axis; in response to the metric distance function, creating a plurality of perceptually uniform samples on the output axis; and, using the inverse of the metric distance function, mapping the third plurality of perceptually uniform samples onto the line.

[0015] In some aspects, generating polygon shapes in 3-D signal space from the perceptually uniform sampled lines includes partitioning a cube representation of 3-D signal space into 6 tetrahedra bounded by the 19 perceptually uniform sampled lines. That is, each tetrahedron is formed with a black (O) vertex, a white (W) vertex, a primary vertex (P) selected from the group including red (R), green (G), and blue (B), and a secondary vertex (S) selected from the group including cyan (C), magenta (M), and yellow (Y).

[0016] In some aspects, generating lines, each including a plurality of perceptually uniform samples, includes generating n samples per line. Then, calculating addition perceptually uniform sample points associated with each polygon includes generating N samples per tetrahedron as follows:

N=n((n+1)(2n+1)/12)+n(n+1)/4;

[0017] inclusive of the n samples per line segment.

[0018] More specifically, calculating addition perceptually uniform sample points associated with each polygon includes: generating (n+1)/2 successively smaller layers for each tetrahedron; and, calculating the location of additional perceptually uniform samples on each of the layers.

[0019] Additional details of the above-described method are presented below.

BRIEF DESCRIPTION OF THE DRAWINGS

[0020]FIG. 1 is a flowchart illustrating the present invention method for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space.

[0021]FIG. 2 is a diagram illustrating vertices connected by lines in a 3-D signal space.

[0022]FIG. 3 is a graph depicting a one-dimensional (1-D) distance function for generating a 1-D perceptually uniform sample distribution.

[0023]FIGS. 4a through 4 f depict an exemplary tetrahedron partitioning of the 3-D signal space.

[0024]FIG. 5 is a diagram depicting an exemplary process of dividing a tetrahedron's sample points into layers.

[0025]FIGS. 6a and 6 b are diagrams illustrating the determination of the sample point distribution on 4 out of the 5 edges of a layer derived from the tetrahedron of FIG. 5.

[0026]FIG. 7 is a diagram illustrating the determination of the sample point distribution of fifth edge Pi-Si of a layer derived from the tetrahedron of FIG. 5.

[0027]FIGS. 8a and 8 b are drawings illustrating the determination of the sample point distribution on the interior of a layer derived from the tetrahedron of FIG. 5.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0028]FIG. 1 is a flowchart illustrating the present invention method for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space. Although the method is depicted as a sequence of numbered steps for clarity, no order should be inferred from the numbering unless explicitly stated. It should be understood that some of these steps may be skipped, performed in parallel, or performed without the requirement of maintaining a strict order of sequence. The method starts at Step 100.

[0029] Step 102 generates a first plurality lines, each including a second plurality of samples, in a printer 3-D signal space. Step 104, in response to the line samples, prints signal space color targets. Step 106 measures the signal space color targets.

[0030] The samples on the lines provide a set of three-tuple RGB specifications. For example, for samples on a line from black to red (R), we have (0, 0, 0), (10, 0, 0), (20, 0, 0), . . . , (100, 0, 0), where the first number specifies the percentage of R, second the percentage of G, and third the percentage of B. A graphic program such as Photoshop can be used to make an electronic file, for example a TIFF file, with a number of color patches. Alternately, a software program can be used to directly output such a TIFF file, without the need for a graphic program. The image in the file consists of several square color patches. For example, the first patch may have an RGB value of (0, 0, 0), the second a value of (10, 0, 0), and so on.

[0031] This TIFF target file is sent to a printer to obtain the output. The output is the printed sheet of paper with square color patches. There are several scenarios on how the printer handles the target after it is received. It may directly use the R, G, and B, values on the graphic file to drive the print engine, to generate a unique mixture of colorants or inks to be put on paper for a color patch. More likely, the printer may: first, convert the RGB specification uniquely to a different specification, such as a CMY specification, a CMYK specification, or some other like specification; and, then, use that other specification to drive the printer. This is because the inks, toners, or colorants are really specified in terms of CMY, CMYK, or CMYK+Orange+Green, and so on, inside the print engine. However, the present invention conversion process is unique in that it treats the printer as a “black box”, and the RGB input treated as a specification to the printer.

[0032] After obtaining the printed sheet of paper, an objective color measurement device can be used, having a X-Y table that permits it to traverse through all the color patches, to obtain the corresponding CIELAB values. The measuring device can be controlled by a computer through a software application. For example, the application may convert the measured CIELAB values back to the correct color and display them on a computer monitor. After the measurement is done (or all the color patched are traversed on the X-Y table), the application provides a text file recording the measured CIELAB values for all the color patches.

[0033] Step 108, from the signal space color targets, generates a first plurality of lines, each line including a plurality of perceptually uniform samples. Step 110 generates polygon shapes in the 3-D signal space from the perceptually uniform sampled lines. Step 112 calculates addition perceptually uniform sample points associated with each polygon. Step 114 generates a final target in the printer 3-D signal space using the calculated perceptually uniform sample points.

[0034]FIG. 2 is a diagram illustrating vertices connected by lines in a 3-D signal space. In some aspects of the method, generating a first plurality lines in a printer 3-D signal space in Step 102 includes generating 19 lines. For example, lines are generated between the black (0), white (W), blue (B), cyan (C), green (G), magenta (M), red (R), and yellow (Y) vertices in RGB or CMY color space. In other aspects, Step 102 generates lines with a second plurality of samples uniformly separated in the 3-D signal space. Note that although these samples are uniformly separated in the 3-D signal space, the uniformly separation need not be a perceptually uniform separation.

[0035]FIG. 3 is a graph depicting a one-dimensional (1-D) distance function for generating a 1-D perceptually uniform sample distribution. In some aspects, generating a first plurality of lines, each including a plurality of perceptually uniform samples in Step 108 includes substeps. Step 108 a, for each line, generates a metric distance function having an input axis to accept signal space samples and an output axis. Step 108 b, in response to the metric distance function, creates a third plurality of perceptually uniform samples on the output axis. Step 108 c using the inverse of the metric distance function, maps the third plurality of perceptually uniform samples onto the line.

[0036] In some aspects, forming a first plurality of lines differentiated into a third plurality of perceptually uniform samples in Step 108 includes generating 1 black-white (OW) line with samples differentiated by brightness (L). Step 108 may generate 6 primary-to-secondary lines with samples differentiated by a red-green channel (a) and a yellow-blue channel (b). Further, 6 lines may be generated with a black (O) vertex and 6 lines with a white (W) vertex, each of the 12 lines having samples differentiated by L, a, b.

[0037]FIGS. 4a through 4 f depict an exemplary tetrahedron partitioning of the 3-D signal space. That is, in some aspects, generating polygon shapes in 3-D signal space from the perceptually uniform sampled lines in Step 110 includes partitioning a cube representation of 3-D signal space into 6 tetrahedra bounded by the 19 perceptually uniform sampled lines. That is, each tetrahedron has with a black (O) vertex, a white (W) vertex, a primary vertex (P) selected from the group including red (R), green (G), and blue (B), and a secondary vertex (S) selected from the group including cyan (C), magenta (M), and yellow (Y). For example, as shown in FIG. 4a, the tetrahedron has the O, W, R, and Y vertices. Note that it is possible to partition the 3-D signal space into other polygon shapes besides tetrahedrons. For example, a five-sided polygon shape (not shown) can be used. The present invention is not limited to any particular polygon shape. However, a tetrahedron shape is used in the following examples to illustrate the invention.

[0038] Returning to FIG. 1, in some aspects, generating a first plurality of lines, each including a plurality of perceptually uniform samples in Step 108 includes generating n samples per line. Then, calculating addition perceptually uniform sample points associated with each polygon in Step 112 includes generating N samples per tetrahedron as follows:

N=n((n+1)(2n+1)/12)+n(n+1)/4;

[0039] inclusive of the n samples per line segment. That is, N includes the samples generated in Step 108, as well as the ones calculated in Step 112.

[0040]FIG. 5 is a diagram depicting an exemplary process of dividing a tetrahedron's sample points into layers. In one aspect, calculating addition perceptually uniform sample points associated with each polygon in Step 112 includes substeps. Step 112 a generates (n+1)/2 successively smaller layers for each tetrahedron. Step 112 b calculates the location of additional perceptually uniform samples on each of the layers. In some aspects, generating a final target in the printer 3-D signal space using the calculated perceptually uniform sample points in Step 114 includes calculating n³ sample points.

[0041] Calculating the location of additional perceptually uniform samples on each of the layers in Step 112 b may include substeps (not shown). Step 112 b 1 defines each layer as having two adjoining triangular faces. Note that for the outer most layer (i=1), Step 112 b 1 finds the two triangular faces as being faces OPS and WPS of the tetrahedron. Step 112 b 2 finds a common edge of the two triangular faces connecting a first vertex (Pi) on the OPW face to a second vertex (Si) on the OSW face of the tetrahedron. Step 112 b 3 finds a third and a fourth vertices, both on the OW line.

[0042] In some aspects, finding a third and fourth vertices in Step 112 b 3 includes, for an inner layer (i>1), the third vertex being the i-th sample (OW_(i)) on the OW line, with respect to black (O), and the fourth vertex being the i-th sample (OW(_(n−i+1))) on the OW line, with respect to white (W). Finding a common edge of the two triangular faces connecting a first vertex (P_(i)) on the OPW face to a second vertex (S_(i)) on the OSW face of the tetrahedron (Step 112 b 2) includes substeps (not shown). Step 112b2a obtains P_(i) by the intersection between the line connecting the i-th sample from W on the WO line and the i-th sample from P on the OP line. Step 112 b 2 b obtains S_(i) by the intersection between the line connecting the i-th sample from W on the WO line and the i-th sample from S on the OS line.

[0043] Alternately stated, in some aspects, Step 112 b calculates the location of additional perceptually uniform samples on each of the layers by: calculating perceptually uniformly distributed samples on each edge of the triangular faces; and, calculating perceptually uniformly distributed samples on the interior of the two triangle faces from the samples on the edges. That is, Step 112 b, for the outer most layer (i=1), uses sample points on the perceptually uniform sampled lines to define the edges of the tetrahedron triangular faces.

[0044]FIGS. 6a and 6 b are diagrams illustrating the determination of the sample point distribution on 4 out of the 5 edges of a layer derived from the tetrahedron of FIG. 5. In some aspects, Step 112 b 4, for an inner layer (i>1), obtains perceptually uniformly distributed samples on OW_(i)-P_(i) by the following procedure:

[0045] for each sample of the on the OW line between OW_(i) and OW_((n−i+1)), finding a corresponding sample on the OP line by the following rule:

[0046] finding a k-th sample from O on the OW line corresponding to a k-th sample from O on the OP line; and,

[0047] calculating the intersections of line OW_(i)-P_(i) and the lines connecting the corresponding samples on OW and OP lines to obtain perceptually uniform sample points on OW_(i)-P_(i).

[0048] In some aspects, Step 112 b 5, for an inner layer (i>1), obtains perceptually uniformly distributed samples on OW_((n−i+1))-P_(i) by the following procedure:

[0049] for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample of the PW line by the following rule:

[0050] finding a k-th sample from O on the OW line corresponding to a k-th sample from P on the PW line; and,

[0051] calculating the intersections of line OW_((n−i+1))-P_(i) and the lines connecting the corresponding samples on OW and PW lines to obtain perceptually uniform sample points on OW_(i)-P_(i).

[0052] Step 112 b 6, for an inner layer (i>1), obtains perceptually uniformly distributed samples on OW_(i)-S_(i) by the following procedure:

[0053] for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample on the OS line by the following rule:

[0054] finding a k-th sample from O on the OW line corresponding to the k-th sample from O on the OS line; and,

[0055] calculating the intersections of line OW_(i)-S_(i) and the lines connecting the corresponding samples on OW and OS lines to obtain perceptually uniform sample points on OW_(i)-Si.

[0056] Step 112 b 7, for an inner layer (i>1), obtains perceptually uniformly distributed samples on OW_((n−i+1))-S_(i) by the following procedure:

[0057] for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample on the SW line by the following rule:

[0058] finding a k-th sample from O on the OW line corresponding to a k-th sample from S on the SW line; and,

[0059] calculating the intersections of line OW_((n−i+1))-S_(i) and the lines connecting the corresponding samples on OW and SW lines to obtain perceptually uniform sample points on OW_(i)-S_(i).

[0060]FIG. 7 is a diagram illustrating the determination of the sample point distribution of the fifth edge P_(i)-S_(i) of a layer derived from the tetrahedron of FIG. 5. Step 112 b 8, for an inner layer (i>1), obtains perceptually uniformly distributed samples on P_(i)-S_(i) being obtained by the following procedure:

[0061] plotting the samples on line PS in the signal space on a horizontal axis of a two-dimensional coordinate system, with point P on the origin;

[0062] constructing a straight line passing through the origin and having a slope equal to the ratio between the length of line segment S_(i)-P_(i) and that of line segment PS_((n−i+1))-PS_(i);

[0063] using the straight line as a transfer function, mapping point PS_(i) on the horizontal axis to P_(i) on the vertical axis, point PS_((n−i+1)) on the horizontal axis to S_(i) on the vertical axis, and every sample on the horizontal axis between PS_(i) and PS_((n−i+1)) on line PS to a point between P_(i) and S_(i) on the vertical axis; and,

[0064] forming perceptually uniform mapped sample points on the vertical axis line segment P_(i)-Si.

[0065]FIGS. 8a and 8 b are drawings illustrating the determination of the sample point distribution on the interior of a layer derived from the tetrahedron of FIG. 5. Step 112 b 9 finds additional perceptually uniform sample points on the interior of each of the two adjoining triangular faces as follows:

[0066] connecting each sample point vertex on a common, first triangular face edge P_(i)-S_(i) to sample points on a second edge S_(i)-OW and a third edge P_(i)-OW according to the following rule:

[0067] finding a k-th sample from P_(i) on the P_(i)-S_(i) first edge corresponding to a k-th sample from P_(i) on the P_(i)-OW third edge, and a k-th sample from S_(i) on P_(i)-S_(i) corresponding to a k-sample from S_(i) on the S_(i)-OW second edge;

[0068] connecting corresponding sample points on the P_(i)-S_(i) first edge and the P_(i)-OW third edge, forming a first group of lines;

[0069] connecting corresponding sample points on the P_(i)-S_(i) first edge and the Si-OW second edge, forming a second group of lines; and,

[0070] making internal interconnection points between the first and second groups of lines perceptually uniform sample points within the triangular faces. With respect to the two adjoining triangular faces, a first triangular face (FIG. 8b) has the vertices of P_(i), S_(i), and OW_((n−i+1)), while a second triangular face (FIG. 8a) has the vertices of P_(i), S_(i), and OW_(i).

[0071] Functional Description

[0072] In generating color conversion tables for printers, there is a need to extensively sample the device color space (such as RGB, CMY, or CMYK) to create a printer target. It is highly desirable to sample the device color space in such a way that the output colors are more or less evenly distributed in a perceptual uniform color space, such as the CIELAB space. However, different types of printers have different characteristics and it is not possible to have one target that works equally well for all types of printers. This invention solves this problem by using a fixed preliminary target that contains a small fraction of the total number of color samples on the final target. By measuring the CIELAB values of the samples on this target, a final target can be automatically constructed with a large number of color patches that sample the CIELAB space approximately uniformly.

[0073] The algorithm works directly with printers having three input channels, such RGB or CMY. Device RGB space is considered to be equivalent to CMY space since R=1-C, G=1-M, and B=1-Y. By incorporating a black generation module that converts RGB or CMY signals into appropriate CMYK signals for printing, this algorithm can also be used for generating CMYK printer targets. The present invention adaptively generates printer characterization targets based on a preliminary target. This algorithm contains three major steps:

[0074] 1. Generate a preliminary printer target that uniformly samples 19 line segments in the device RGB space. Print and measure the output colors in the CIELAB space. The 19 line segments to be sampled are shown in FIG. 2: a neutral (or nearly neutral) line from black (0) to white (W), lines from black (O) to the primary colors R, G, and B, lines from black (O) to secondary colors C, M, and Y, lines from primary colors R, G, and B to white (W), lines from secondary color C, M, and Y to white (W), and lines connecting a primary color with an adjacent secondary color, RM, RY, GC, GY, BC, and BM. In one implementation, 14 points are used to sample each line segment, creating a preliminary target with 266 color sample patches. The final target may contain either 9×9×9 or 12×12×12 color sample patches, for example. In general, the number of points per line segment for the preliminary target should be a little bit bigger than the number of samples per dimension of the final target. However, this is not a strict requirement.

[0075] 2. With the measured CIELAB data, the specified number of samples per dimension (for example, either 9 or 12) are distributed on each of the 19 line segments in such a way that they are approximately uniformly distributed in the CIELAB space. The algorithm for accomplishing this is illustrated in FIG. 3, where the number of points per line segment in the preliminary target is 9, and the number of samples per dimension in the final target is 5, as an example. First, a function of distance versus the uniformly sampled input points on the line segment is constructed, where the increment in the “Distance” axis is a metric distance in the CIELAB space between two adjacent input points. In one implementation, the 1-D distance in L, for the line segments from black to white, is used. Since for this is a neutral (nearly neutral) segment, a and b will not contribute much to the distance. For the 6 line segments that connect a primary color to a secondary color, the 2-D distance in a and b is used since it is desirable to spread the sample points evenly around the hue circle. For the rest of the line segments, the 3-D Lab (L, a, b) distance measure is used. The choice of 1-D, 2-D, or 3-D distance measure is not a critical aspect of this algorithm. After constructing the distance function, the output distance axis is sampled uniformly using the number of samples per dimension of the final target, and using the inverse function mapping to obtain the desired final sample point distribution on the line segment in the RGB (or CMY) target space.

[0076] 3. With sample points on the 19 line segments decided, sample points are obtained for distribution within or on tetrahedra constructed by 6 of these line segments. As shown in FIGS. 4a through 4 f, an RGB cube can be partitioned into 6 tetrahedra. The rank ordering of RGB values of a RGB point can be used to match an RGB point with a tetrahedron. Letting n³ be the number of samples for the final target (size n per dimension), the number of samples per tetrahedron is

N_(T) =n(n+1)(2n+1)12+n(n+1)/4.

[0077] In one aspect of the algorithm, the sample point distribution on each triangular face of a tetrahedron is completely determined by the sample point distributions on the line segments bounding the triangle. This distribution guarantees that a face common to two tetrahedra receives the same sample point distribution from either tetrahedron. The detailed algorithm for distributing sample points on a tetrahedron is described below.

[0078] By observing the tetrahedra of FIGS. 4a through 4 f, it can see that all 6 tetrahedra can be described by a generic tetrahedron with black point (O), white point (W), and a primary (R, G, or B) color, and a secondary color (C, M, or Y) as vertices. This is shown in FIG. 5, where the primary color vertex is denoted by P and the secondary color by S. The concept of sample point layers is also described in this figure. The N_(T) sample points on a tetrahedron can be divided into └(n+1)/2┘ layers. The outermost layer (Layer 1) contains sample points on the two triangular faces OPS and WPS. The construction of a general inner Layer i, consisting of triangles with vertices {OW_(i), P_(i), S_(i)} and {OW_((n−i+1)),P_(i),S_(i)}, is shown in the figure, where OW_(i) and OW_((n−i+1)) are the i-th and (n−i+1)-th sample points on OW, respectively. Point P_(i) is obtained by the intersection of lines with end points {OW_(i),PW_(i)} and {OW_((n−i+1))OP_((n−i+1))} on the OPW plane, where PW_(i) is the i-th sample point on PW and OP_((n−i+1)) is the (n−i+1)-th sample point on OP, respectively. Point S_(i) is determined by the intersection of lines with end points {OW_(i),SW_(i)} and {OW_((n−i+1)),OS_((n−i+1))} on the OSW plane, where SW_(i) is the i-th sample point on SW and OS_((n−i+1)) is the (n−i+1)-th sample point on OS, respectively. For the outermost layer (Layer 1), the sample distributions on all the line segments specifying the layer are determined. For inner layers, the distribution of sample points on these line segments must be determined. Then, the sample point distribution of each layer must be determined. For the i-th layer, where i=1,2,K, └(n+1)/2┘, the number of sample points for each line segment is (n−2i+2) and the number of sample point on each layer is (n−2i+2)². The overall procedure of the algorithm for distributing sample points in a tetrahedron is summarized by the following pseudo-code. for each of the 6 tetrahedra {   Identify the primary and secondary vertices (P and S).   Identify the sample distribution of each edge.   for i = 1,2,K ,└(n+1)/2┘ {     if i ≠ 1 {       Obtain sample distribution on the edges       of the i-th layer.     }     Obtain sample distribution on the interior of the     triangular faces of the i-th layer.   } }

[0079] The methods for obtaining the sample distribution on the edges of the i-th layer are illustrated in FIGS. 6a, 6 b, and 7. The sample points on the edge with end points {OW_(i),OW_((n−i+1))} are just a subset of the sample points on OW, which are already determined. The process for determining the sample points on edges {OW_(i),P_(i)} and {OW_((n−i+1)),P_(i)} is shown in FIG. 6a. For each sample points OW_(k) between OW_(i) and OW_((n−i+1)), a sample point OP_(i)(k) is obtained on edge {OW_(i),P_(i)} by finding the intersection between line {OW_(k), OP_(k)} and the edge on the OPW plane. Similarly, sample point PW_(i)(k) on edge {OW_((n−i+1)),P_(i),} is obtained by finding the intersection between line {OW_(k),PW_(k)} and the edge. FIG. 6b illustrates a similar process for determining sample points on edges {OW_(i),S_(i)} and {OW_((n−i+1)),S_(i)} on the OSW plane. The process for obtaining the sample points on the last edge {P_(i),S_(i)} is illustrated by FIG. 7. They are obtained by linearly mapping the sample points between the i-th and (n−i+1)-th sample points on the outer most edge PS. The slope of the linear mapping is the ratio of the length between line segments {P_(i),S_(i)} and {PS_(i),PS_((n−i+1))}.

[0080] Finally, the method for obtaining the interior sample point distribution on the two triangular faces of a layer is illustrated in FIGS. 8a and 8 b. As shown in FIG. 8a, the sample points on triangle {OW_(i),P_(i),S_(i)} are obtained by intersections between lines connecting a sample point on {P_(i),S_(i)} with its corresponding sample point on {OW_(i),P_(i)} and {OW_(i),S_(i)}, respectively. Similarly, the process of obtaining sample points on triangle {OW_((n−i+1)),P_(i),S_(i)} is illustrated in FIG. 8b.

[0081] A method has been presented for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space. A few examples have been presented to illustrate the invention using a particular number of vertices and lines, samples per line, polygon shapes, and a process of determining polygon inner layer sample points. However, the invention is not limited to merely these examples. Other variations and embodiments of the invention will occur to those skilled in the art. 

We claim:
 1. A method for adaptively generating perceptually uniform printer characterization samples in a three-dimensional (3-D) signal space, the method comprising: generating a first plurality lines, each including a second plurality of samples, in a printer 3-D signal space; in response to the line samples, printing signal space color targets; measuring the signal space color targets; from the signal space color targets, generating a first plurality of lines, each line including a plurality of perceptually uniform samples; generating polygon shapes in the 3-D signal space from the perceptually uniform sampled lines; calculating addition perceptually uniform sample points associated with each polygon; and, generating a final target in the printer 3-D signal space using the calculated perceptually uniform sample points.
 2. The method of claim 1 wherein generating a first plurality lines in a printer 3-D signal space includes generating 19 lines.
 3. The method of claim 1 wherein generating a first plurality of lines in a printer 3-D signal space includes generating lines between vertices selected from the group including black (O), white (W), blue (B), cyan (C), green (G), magenta (M), red (R), and yellow (Y) vertices in RGB and CMY color space.
 4. The method of claim 1 wherein generating a first plurality lines, each including a second plurality of samples, in a printer 3-D signal space includes generating a second plurality of samples uniformly separated in the 3-D signal space.
 5. The method of claim 4 wherein generating a first plurality of lines, each including a plurality of perceptually uniform samples includes: for each line, generating a metric distance function having an input axis to accept signal space samples and an output axis; in response to the metric distance function, creating a third plurality of perceptually uniform samples on the output axis; and, using the inverse of the metric distance function, mapping the third plurality of perceptually uniform samples onto the line.
 6. The method of claim 5 wherein forming a first plurality of lines differentiated into a third plurality of perceptually uniform samples includes generating 1 black-white (OW) line with samples differentiated by brightness (L).
 7. The method of claim 5 wherein forming a first plurality of lines differentiated into a third plurality of perceptually uniform samples includes generating 6 primary-to-secondary lines with samples differentiated by a red-green channel (a) and a yellow-blue channel (b).
 8. The method of claim 5 wherein forming a first plurality of lines differentiated into a third plurality of perceptually uniform samples includes generating 6 lines with a black (O) vertex and 6 lines with a white (W) vertex, each of the 12 lines having samples differentiated by L, a, b.
 9. The method of claim 3 wherein generating polygon shapes in 3-D signal space from the perceptually uniform sampled lines includes partitioning a cube representation of 3-D signal space into 6 tetrahedra bounded by the 19 perceptually uniform sampled lines.
 10. The method of claim 9 wherein partitioning a cube representation of 3-D signal space into 6 tetrahedra bounded by the 19 perceptually uniform sampled lines includes forming each tetrahedron with a black (O) vertex, a white (W) vertex, a primary vertex (P) selected from the group including red (R), green (G), and blue (B), and a secondary vertex (S) selected from the group including cyan (C), magenta (M), and yellow (Y).
 11. The method of claim 10 wherein generating a first plurality of lines, each including a plurality of perceptually uniform samples includes generating n samples per line; and, wherein calculating addition perceptually uniform sample points associated with each polygon includes generating N samples per tetrahedron as follows: N=n((n+1)(2n+1)/12)+n(n+1)/4; inclusive of the n samples per line segment.
 12. The method of claim 11 wherein calculating addition perceptually uniform sample points associated with each polygon includes: generating (n+1)/2 successively smaller layers for each tetrahedron; and, calculating the location of additional perceptually uniform samples on each of the layers.
 13. The method of claim 12 wherein generating a final target in the printer 3-D signal space using the calculated perceptually uniform sample points includes calculating n³ sample points.
 14. The method of claim 12 wherein calculating the location of additional perceptually uniform samples on each of the layers includes: defining each layer as having two adjoining triangular faces; finding a common edge of the two triangular faces connecting a first vertex (P_(i)) on the OPW face to a second vertex (S_(i)) on the OSW face of the tetrahedron; and, defining a third and a fourth vertices, both on the OW line.
 15. The method of claim 14 wherein defining a third and a fourth vertices includes, for an inner layer (i>1), defining the third vertex being the i-th sample (OW_(i)) of the on the OW line, with respect to black (O), and the fourth vertex being the i-th sample (OW_((n−i+1))) on the OW line, with respect to white (W); and, wherein finding a common edge of the two triangular faces connecting a first vertex (P_(i)) on the OPW face to a second vertex (S_(i)) on the OSW face of the tetrahedron includes: obtaining P_(i) by the intersection between the line connecting the i-th sample from W on the WO line and the i-th sample from P on the OP line; and, obtaining S_(i) by the intersection between the line connecting the i-th sample from W on the WO line and the i-th sample from S on the OS line.
 16. The method of claim 15 wherein calculating the location of additional perceptually uniform samples on each of the layers includes: calculating perceptually uniformly distributed samples on each edge of the triangular faces; and, calculating perceptually uniformly distributed samples on the interior of the two triangle faces from the samples on the edges.
 17. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for the outer most layer (i=1), using sample points on the perceptually uniform sampled lines to define the edges of the tetrahedron triangular faces.
 18. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for an inner layer (i>1), perceptually uniformly distributed samples on OW_(i)-P_(i) being obtained by the following procedure: for each sample of the on the OW line between OW_(i) and OW_((n−i+1)), finding a corresponding sample on the OP line by the following rule: finding a k-th sample from O on the OW line corresponding to a k-th sample from O on the OP line; and, calculating the intersections of line OW_(i)-P_(i) and the lines connecting the corresponding samples on OW and OP lines to obtain perceptually uniform sample points on OW_(i)-P_(i).
 19. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for an inner layer (i>1), perceptually uniformly distributed samples on OW_((n−i+1))-P_(i) being obtained by the following procedure: for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample of the PW line by the following rule: finding a k-th sample from O on the OW line corresponding to a k-th sample from P on the PW line; and, calculating the intersections of line OW_((n−i+1))-P_(i) and the lines connecting the corresponding samples on OW and PW lines to obtain perceptually uniform sample points on OW_(i)-P_(i).
 20. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for an inner layer (i>1), perceptually uniformly distributed samples on OW_(i)-S_(i) being obtained by the following procedure: for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample on the OS line by the following rule: finding a k-th sample from O on the OW line corresponding to a k-th sample from O on the OS line; and, calculating the intersections of line OW_(i)-S_(i) and the lines connecting the corresponding samples on OW and OS lines to obtain perceptually uniform sample points on OW_(i)-Si.
 21. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for an inner layer (i>1), perceptually uniformly distributed samples on OW_((n−i+1))-S_(i) being obtained by the following procedure: for each sample on the OW line between OW_(i) and OW_((n−i+1)), finding its corresponding sample on the SW line by the following rule: finding a k-th sample from O on the OW line corresponding to a k-th sample from S on the SW line; and, calculating the intersections of line OW_((n−i+1))-S_(i) and the lines connecting the corresponding samples on OW and SW lines to obtain perceptually uniform sample points on OW_(i)-S_(i).
 22. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes, for an inner layer (i>1), perceptually uniformly distributed samples on P_(i)-S_(i) being obtained by the following procedure: plotting samples on line PS in the signal space on a horizontal axis of a two-dimensional coordinate system, with point P on the origin; constructing a straight line passing through the origin and having a slope equal to the ratio between the length of line segment S_(i)-P_(i) and that of line segment PS_((n−i+1))-PS_(i); using the straight line as a transfer function, mapping point PS_(i) on the horizontal axis to P_(i) on the vertical axis, point PS_((n−i+1)) on the horizontal axis to S_(i) on the vertical axis, and every sample on the horizontal axis between PS_(i) and PS_((n−i+1)) on line PS to a point between P_(i) and S_(i) on the vertical axis; and, forming perceptually uniform mapped sample points on the vertical axis line segment P_(i)-S_(i).
 23. The method of claim 16 wherein calculating the location of additional perceptually uniform samples on each of the layers includes finding additional perceptually uniform sample points on the interior of each of the two adjoining triangular faces as follows: connecting each sample point vertex on a common, first triangular face edge P_(i)-S_(i) to sample points on a second edge S_(i)-OW and a third edge P_(i)-OW according to the following rule: finding a k-th sample from P_(i) on the P_(i)-S_(i) first edge corresponding to a k-th sample from P_(i) on the P_(i)-OW third edge, and a k-th sample from S_(i) on P_(i)-S_(i) corresponding to a k-sample from S_(i) on the S_(i)-OW second edge; connecting corresponding sample points on the P_(i)-S_(i) first edge and the P_(i)-OW third edge, forming a first group of lines; connecting corresponding sample points on the P_(i)-S_(i) first edge and the S_(i)-OW second edge, forming a second group of lines; and, making internal interconnection points between the first and second groups of lines perceptually uniform sample points within the triangular faces.
 24. The method of claim 23 wherein finding additional perceptually uniform sample points on the interior of each of the two adjoining triangular faces includes a first triangular face having the vertices of P_(i), S_(i), and OW_((n−i+1)).
 25. The method of claim 23 wherein finding additional perceptually uniform sample points on the interior of each of the two adjoining triangular faces includes a second triangular face having the vertices of P_(i), S_(i), and OW_(i).
 26. The method of claim 14 wherein for the outer most layer (i=1), defining each layer as having two adjoining triangular faces includes finding the two triangular faces as being faces OPS and WPS of the tetrahedron. 